Additional Experiments with Probabilistic Escape LIFO

The probabilistic escape LIFO (peLIFO) policy was proposed as a member of the pseudo-LIFO family of replacement policies [1]. This is a deterministic replacement policy that computes certain probabilities to reach a deterministic eviction decision in last-level caches. This brief note includes a few additional experimental results involving the peLIFO policy, a discussion on the impact of L2 cache replacement policies on the memory system performance, a brief specification of the sampled sets used in the set dueling technique, and a low-overhead approximation of peLIFO. This note should be read as an appendix to [1].